Disjunctive Temporal Planning with Uncertainty
نویسندگان
چکیده
Driven by planning problems with both disjunctive constraints and contingency, we define the Disjunctive Temporal Problem with Uncertainty (DTPU), an extension of the DTP that includes contingent events. Generalizing existing work on Simple Temporal Problems with Uncertainty, we divide the time-points into controllable and uncontrollable classes, and propose varying notions of controllability to replace the notion of consistency.
منابع مشابه
Apprentissage de règles associatives temporelles pour les séquences temporelles de symboles. (Learning temporal association rules on Symbolic time sequences)
The learning of temporal patterns is a major challenge of Data mining. We introduce a temporal pattern model called Temporal Interval Tree Association Rules (Tita rules or Titar). This pattern model can be used to express both uncertainty and temporal inaccuracy of temporal events. Among other things, Tita rules can express the usual time point operators, synchronicity, order, and chaining,disj...
متن کاملPlanning with Disjunctive Temporal Constraints
Many real-world problems contain elements of both planning and scheduling problems. In response, many frameworks and systems have been developed that add scheduling abilities to planning systems. We continue this trend by presenting a framework and algorithm for planning with disjunctive temporal constraints. We define a constraint-based interval (CBI) framework for describing a planning proble...
متن کاملSolving Temporal Problems Using SMT: Strong Controllability
Many applications, such as scheduling and temporal planning, require the solution of Temporal Problems (TP’s) representing constraints over the timing of activities. A TP with uncertainty (TPU) is characterized by activities with uncontrollable duration. Depending on the Boolean structure of the constraints, we have simple (STPU), constraint satisfaction (TCSPU), and disjunctive (DTPU) temporal...
متن کاملFast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the effect of uncertainty and disturbance is to dynamically schedule the plan online, through dispatchable execution. Dispatchable execution increases the efficiency of plan execution by introducing (1) a compiler that redu...
متن کاملStrong Controllability of Disjunctive Temporal Problems with Uncertainty
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing agent. We investigate the semantics of DTPU constraints, refining the existing notion that they are simply disjunctions of STPU constraints. We then develop the first sound and complete algorithm to determine whether S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005